A Branch-Cut-and-Price Approach for the Single-Trip and Multi-Trip Two-Echelon Vehicle Routing Problem with Time Windows

A Branch-and-price Approach for a Multi-trip Vehicle Routing Problem with Time Windows and Driver Work Hours

This study considers a vehicle routing problem with time windows, accessibility restrictions on customers and a fleet that is heterogeneous with regard to capacity and average speed. A vehicle can perform multiple routes per day, all starting and ending at a single depot, and it is assigned to a single driver, whose total work hours are limited. A column generation algorithm embedded in a branc...

Branch & Price Based Algorithms for the Two-Echelon Vehicle Routing Problem with Time Windows

A tabu search for Time-dependent Multi-zone Multi-trip Vehicle Routing Problem with Time Windows

We propose a tabu search meta-heuristic for the Time dependent Multi-zone Multi-trip Vehicle Routing Problem with Time Windows. Two types of neighborhoods, corresponding to two decision sets of the problem, together with a strategy controlling the selection of the neighborhood type for particular phases of the search, provide the means to set up and combine exploration and exploitation capabili...

A branch-price-and-cut for the vehicle routing problem with time windows and multiple deliverymen

We address a variant of the vehicle routing problem with time windows, which includes the decision of how many deliverymen should be assigned to each vehicle in addition to the usual routing and scheduling decisions. This variant is relevant in cases in which many requests should be delivered in busy urban areas on the same day, and the service times at customers are long in relation to vehicle...

A study on multi-trip vehicle routing problem with time windows and meal break considerations